package ink.lovejinhu.leetcode;

/**
 * @author jinhu
 * created 2021-08-13 17:33
 */
public class Solution_0060 {
    /**
     * 康托展开式
     *
     * @param n
     * @param k
     * @return
     */
    public String getPermutation(int n, int k) {
        String s = "";

        while (n > 0) {
            int jc = jc(n - 1);


        }
        return "";
    }

    public int jc(int n) {
        int res = 1;
        for (int i = 1; i <= n; i++) {
            res *= i;
        }
        return res;
    }
}
